The operator prior table of an operator grammar can be solved by Boolean matrix theory. Usually, the relations used were defined on a set of all grammar characters and yield a series great scale Boolean matrices. 算符文法的算符优先表可以用布尔矩阵理论求解,传统的算法在文法的全部符号集合上定义各类关系,导致布尔矩阵规模较大。